package com.formula.datastructure.exercise.tree;

/**
 * 三叉链表
 */
public class HuffmanNode {
    public Integer data;
    public int leftIdx;
    public int rightIdx;
    public int parentIdx;

    public HuffmanNode(Integer data) {
        this(data, -1, -1, -1);
    }

    public HuffmanNode(Integer data, int leftIdx, int rightIdx, int parentIdx) {
        this.data = data;
        this.leftIdx = leftIdx;
        this.rightIdx = rightIdx;
        this.parentIdx = parentIdx;
    }
}
